The Fast Fourier Transform Algorithm in Ruin Theory for the Classical Risk Model
نویسنده
چکیده
We focus on numerical evaluation of some quantities of interest in ruin theory, and on the practical use of the fast Fourier transform algorithm (FFT) in this context. We discuss the general application of the FFT for stochastic models, and we illustrate this by looking again at the probability of ruin in the classical risk model and by extending this approach to evaluation of the first moment of the time to ruin in the classical model. I. RUIN QUANTITIES IN THE CLASSICAL RISK MODEL In the classical risk model in insurance mathematics, claims arrive in a Poisson process, rate , and claim sizes are independent identically distributed random variables , independent of the claim arrivals process. Let denote the claim-size distribution function, and let , , assumed finite as necessary. Premiums arrive linearly in time at rate , and we write ! "# %$ & ' ( , where & , the premium loading factor, is assumed to be stricly positive. The surplus at time ) is *+",) ' .-/$0 1)32547698;:=< >@?BA > , where CED is the initial surplus, and F0",) ' is the number of claims that have arrived by time ) . Then ruin is said to occur if *+",) ' ever becomes negative. Let GH"I-J'K LNMPO QR)TS9*+",) ' UVDPW be the time of ruin. We have
منابع مشابه
On The Moments Of The Time To Ruin Distribution When The Initial Reserve Is Large And Claim Amount Distribution Is Two Stage Hypo Exponential Distribution
In any classical risk model one of the important random variable is time to ruin. As time to ruin warns the management for possible adverse situations that may arise, the distribution of time to ruin place a vital role in the day to day transactions of the any insurance company. Moments of the distribution are also important as coefficient of skewness of the distribution is very important in ac...
متن کاملOn the Distribution of Discounted Collective Risk Model
We study the distribution of discounted collective risk model where the counting process is Poisson. For the model considered here, we obtain mean, variance and moment generating function (m.g.f) of the model. To do this, we use two approaches. In the first approach we use classical methods to obtain the mean and variance. In the second approach we introduce some proper martingale and then we o...
متن کاملFast Signal Transforms for Quantum
We present the discrete Fourier transform as a basic primitive in the treatment of controlled quantum systems. Based on the complexity model for quantum circuits the Fourier transform of size 2 n surprisingly can be realised with O(n 2) elementary operations which is an exponential speedup compared to the classical case. This is the reason for its presence in almost all known quantum algorithms...
متن کاملProjective Fourier Analysis in Computer Vision: Theory and Computer Simulations
Identifying the projective group for patterns by developing the camera model, the projective Fourier transform and its inverse are obtained in analogy with the classical, that is, Euclidean Fourier analysis. Projectively adapted properties are demonstrated in a numerical test. Using the expression of the projective Fourier integral by a standard Fourier integral in the coordinates given by the ...
متن کاملOption pricing under the double stochastic volatility with double jump model
In this paper, we deal with the pricing of power options when the dynamics of the risky underling asset follows the double stochastic volatility with double jump model. We prove efficiency of our considered model by fast Fourier transform method, Monte Carlo simulation and numerical results using power call options i.e. Monte Carlo simulation and numerical results show that the fast Fourier tra...
متن کامل